Existing certificateless proxy signature schemes based on classical number theory problem assumptions cannot resist to quantum computer attacks， and when these schemes are applied to systems with a large number of users， there are limitations such as single point of failure and low scalability. Aiming at these problems， a lattice-based hierarchical certificateless proxy signature scheme was proposed. Firstly， the rejection sampling technology and trapdoor-free technology were used to improve the computational efficiency of key generation. Secondly， the mutual authentication was performed by the original signers and proxy signers at different levels by exchanging randomly selected matrices， and then the proxy authorization was realized. Finally， the security of this scheme was proved under the of the Small Integer Solution （SIS） hard problem assumption in the random oracle model. Compared with the existing proxy signature schemes， the proposed scheme allows signers coming from different levels and belonging to different Key Generation Centers （KGCs）. The performance evaluation experimental results show that in the proposed scheme， the public key size is a constant， the overhead of proxy signature and verification is independent of the level， and the proxy key size and the signature size are not hierarchical linear quantities， so that this scheme can better meet the needs of large-scale distributed heterogeneous networks for load balancing， and is efficient and feasible.